Adversarial queuing theory with setupsKIWI, M; SOTO, M; THRAVES, C et al.Theoretical computer science. 2009, Vol 410, Num 8-10, pp 670-687, issn 0304-3975, 18 p.Article

Linear connectivity problems in directed hypergraphsTHAKUR, Mayur; TRIPATHI, Rahul.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2592-2618, issn 0304-3975, 27 p.Article

STABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMSANSHELEVICH, Elliot; KEMPE, David; KLEINBERG, Jon et al.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1656-1673, issn 0097-5397, 18 p.Article

Ranks of graphs : The size of acyclic orientation cover for deadlock-free packet routingKRALOVIC, R; RUZICKA, P.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 203-213, issn 0304-3975, 11 p.Article

Acyclic orientations do not lead to optimal deadlock-free packet routing algorithmsSTEFANKOVIC, D.Information processing letters. 2000, Vol 73, Num 5-6, pp 221-225, issn 0020-0190Article

A note on deflection worm routing on meshesSYMVONIS, A.Information processing letters. 1999, Vol 71, Num 5-6, pp 235-239, issn 0020-0190Article